Deriving Symbolic Representations from Stochastic Process Algebras
نویسندگان
چکیده
A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multiterminal binary decision diagrams. It is shown that the new semantics is Markovian bisimulation equivalent to the standard SOS semantics. The paper also addresses the difficult question of keeping the underlying state space minimal at every construction step.
منابع مشابه
Activity-local symbolic state graph generation for high-level stochastic models
This paper introduces a new, efficient method for deriving compact symbolic representations of very large (labelled) Markov chains resulting from high-level model specifications such as stochastic Petri nets, stochastic process algebras, etc.. This so called “activity-local” scheme is combined with a new data structure, called zero-suppressed multi-terminal binary decision diagram, and a new ef...
متن کاملAdvances in Model Representations
We review high-level speciication formalisms for Markovian performability models, thereby emphasising the role of structuring concepts as realised par excellence by stochastic process algebras. Symbolic representations based on decision diagrams are presented, and it is shown that they quite ideally support compositional model construction and analysis.
متن کاملComputing Bisimulations for Stochastic Process Algebras using Symbolic Representations
Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addre...
متن کاملStochastic Models on a Ring and Quadratic Algebras. The Three Species Diffusion Problem
The stationary state of a stochastic process on a ring can be expressed using traces of monomials of an associative algebra defined by quadratic relations. If one considers only exclusion processes one can restrict the type of algebras and obtain recurrence relations for the traces. This is possible only if the rates satisfy certain compatibility conditions. These conditions are derived and the...
متن کاملSymbolic semantics and verification of stochastic process algebras
ion can be seen as the combination of all possible restrictions to a set of variables combined by an associative binary operator ⋆. Formally, this can be defined as follows: Abstract(B, (xi, ..., xm), ⋆) := B ∣ ∣ xi,...,xm:=(0,...,0) ⋆ ... ⋆ B ∣
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002